/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;

ll d[maxn], a[maxn],c[maxn];

int n, m, w;
void add(int x,ll val){
    while(x<=n){
        d[x] += val;
        x += x & -x;
    }
}

ll get(int x){
    ll ret = 0;
    while(x){
        ret += d[x];
        x -= x & -x;
    }

    return ret;
}


bool judge(ll x){
    for (int i = 1;i<=n;i++)
        d[i] = c[i];

    ll ha = 0;
    for (int i = 1; i <= n;i++){
        ll now = get(i);
        if(now<x){
           // cout << "gengxin:" << now << endl;
            ha += x - now;
            add(i,x-now);
            add(i+w, now - x);
        }
    }
    //cout << x << ',' << ha << endl;
    return ha <= m;
}
int main()
{
    IOS;

    cin >> n >> m >> w;

    for (int i = 1; i <= n;i++){
        cin >> a[i];
        add(i, a[i] - a[i - 1]);
    }
    for (int i = 1; i <= n;i++)
        c[i] = d[i];

        ll ans = 0;
    ll l = 0, r = (ll)(2e9);
    while(l<=r){
        cout << l << ',' << r << endl;
        ll mid = (l + r) >> 1;

        if(judge(mid)){
            ans = max(ans, mid);
            l = mid+1;
        }
        else{
            r = mid-1;
        }
    }
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}

/*

3 1 1
2 2 2

*/